Graph coloring - PDFSEARCH.IO - Document Search Engine

Graph coloring
Results: 948

#	Item
841	An extension of the bivariate chromatic polynomial Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2008-12-16 10:45:27 Matroid theory Polynomials Graph coloring Tutte polynomial Chromatic polynomial Matroid Graph property Matching Graph Mathematics Graph theory Theoretical computer science
842	SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM* BY GERHARD RINGEL AND J. W. T. YOUNGS UNIVERSITY OF CALIFORNIA (SANTA CRUZ) Add to Reading List Source URL: www.pnas.org Language: English - Date: 2005-04-22 15:17:54 Topological graph theory Conjectures Heawood conjecture Four color theorem Gerhard Ringel Torus Cayley graph Manifold Graph Graph theory Mathematics Graph coloring
843	The Borsuk-Ulam Theorem and Bisection of Necklaces Author(s): Noga Alon and Douglas B. West Source: Proceedings of the American Mathematical Society, Vol. 98, No. 4 (Dec., 1986), pp[removed] Add to Reading List Source URL: www.tau.ac.il Language: English - Date: 2010-03-11 05:06:26 Borsuk–Ulam theorem Graph coloring Integral Ham sandwich theorem Mathematics Combinatorics Algebraic topology
844	Testing k-colorability Noga Alon Add to Reading List Source URL: www.tau.ac.il Language: English - Date: 2002-02-21 20:36:39 Extremal graph theory Cycle graph Graph property Graph Bipartite graph Uniquely colorable graph Graph theory Mathematics Graph coloring
845	On the Euler Characteristic Edward Early Abstract. We discuss the Euler Characteristic and some of the consequences of its topological invariance. We start by following the path of history that motivated the study Add to Reading List Source URL: www-math.mit.edu Language: English - Date: 2000-02-02 14:29:27 Planar graphs Topological graph theory Polyhedral combinatorics Euler characteristic Water gas and electricity Four color theorem Graph Graph structure theorem Planar separator theorem Graph theory Mathematics Graph coloring
846	Early Writings on Graph Theory: Euler Circuits and The K¨onigsberg Bridge Problem Janet Heine Barnett∗ Add to Reading List Source URL: www.math.nmsu.edu Language: English - Date: 2012-09-11 15:06:40 Graph coloring Eulerian path Leonhard Euler Induced path Four color theorem Graph Degree Seven Bridges of Königsberg Handshaking lemma Graph theory Mathematics Planar graphs
847	REPORTS IN INFORMATICS Add to Reading List Source URL: www.ii.uib.no Language: English - Date: 2007-08-06 05:58:33 NP-complete problems Dominating set Graph coloring Travelling salesman problem Approximation algorithm Algorithm Feedback vertex set Time complexity Set cover problem Theoretical computer science Computational complexity theory Mathematics
848	COLLOQUIA MATHEMATICA SOCIETATIS JAN05 BOLYAI 10 . INFINITE AND FINITE SETS, KESZTHELY (HUNGARY), 1973 . Add to Reading List Source URL: www.cs.elte.hu Language: English - Date: 2007-05-29 11:08:23 Hypergraph NP-complete problems Packing in a hypergraph Erdős–Faber–Lovász conjecture Graph theory Mathematics Graph coloring
849	Expander Flows, Geometric Embeddings and Graph Partitioning SANJEEV ARORA Princeton University Add to Reading List Source URL: www.cs.princeton.edu Language: English - Date: 2013-01-06 00:21:58 Combinatorial optimization NP-complete problems Cut Maximum flow problem Graph embedding Matching Vertex cover Big O notation Graph coloring Mathematics Theoretical computer science Graph theory
850	Register Allocation after Classical SSA Elimination is NP-complete Fernando Magno Quint˜ao Pereira Add to Reading List Source URL: www.cs.ucla.edu Language: English - Date: 2006-02-05 20:11:50 Static single assignment form Graph coloring Register allocation Graph Intersection graph Chordal graph Path decomposition Trapezoid graph Graph theory Theoretical computer science Mathematics

UPDATE